Tower: data structures in Quantum superposition

Emerging quantum algorithms for problems such as element distinctness, subset sum, and closest pair demonstrate computational advantages by relying on abstract data structures. Practically realizing an algorithm a program computer requires efficient implementation of the structure whose operations correspond to unitary operators that manipulate superpositions data. To correctly operate in superposition, must satisfy three properties -- reversibility, history independence, bounded-time execution. Standard implementations, representation set hash table, fail these properties, calling tools develop specialized implementations. In this work, we present Core Tower, first language programming with random-access memory. Tower enables developer implement structures pointer-based, linked It features reversible semantics enabling every valid be translated circuit. We Boson, memory allocator supports reversible, history-independent, constant-time dynamic allocation superposition. also recursively defined type system bounds all recursion using classical parameters is necessary execute computer. Using Ground, library structures, including lists, stacks, queues, strings, sets. provide executable sets satisfies mandated